HCCMeshes: Hierarchical-Culling oriented Compact Meshes
نویسندگان
چکیده
منابع مشابه
Hierarchical Back-Face Culling
We present a sub linear algorithm for computing and culling back facing polygons that yields a signi cant performance improvement in the interactive rendering of large polygonal models The algorithm partitions a polygonal model it into hierarchical clusters based on the normals and positions of the polygons It does not explicitly compute all the back facing polygons but rather decides in expect...
متن کاملCHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued occlusion queries and the number of ren...
متن کاملHierarchical Visibility Culling for Spline Models
We present hierarchical algorithms for visibility culling of spline models This includes back patch culling a generalization of back face culling for poly gons to splines These algorithms are extended to trimmed surfaces as well We propose di erent spa tial approximations for enclosing the normals of a spline surface and compare them for e ciency and e ectiveness on di erent graphics systems We...
متن کاملHierarchical back-face culling for collision detection
A few years ago, Vanecek[16] suggested to apply a variant of back-face culling to speed-up collision detection between polyhedral objects. However, Vanecek’s method is linear in the number of faces in the object, which is unpractical for large models. This paper suggests to add some geometrical information to hierarchies of bounding volumes, typically used in collision detection, and perform co...
متن کاملHierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity proportional to the number of visible graphic primitives in the resulting image. In this paper an algorithm allowing efficient culling of the invisible portion of the rendered model is presented. Our approach uses a spatia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2010
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2009.01599.x